Parameter testing in bounded degree graphs of subexponential growth
نویسندگان
چکیده
منابع مشابه
Parameter testing in bounded degree graphs of subexponential growth
Parameter testing algorithms are using constant number of queries to estimate the value of a certain parameter of a very large finite graph. It is well-known that graph parameters such as the independence ratio or the edit-distance from 3-colorability are not testable in bounded degree graphs. We prove, however, that these and several other interesting graph parameters are testable in bounded d...
متن کاملOn Testing Expansion in Bounded-Degree Graphs
We consider testing graph expansion in the bounded-degree graph model. Specifically, we refer to algorithms for testing whether the graph has a second eigenvalue bounded above by a given threshold or is far from any graph with such (or related) property. We present a natural algorithm aimed towards achieving the foregoing task. The algorithm is given a (normalized) eigenvalue bound λ < 1, oracl...
متن کاملTesting Expansion in Bounded Degree Graphs
We consider the problem of testing graph expansion in the bounded degree model. We give a property tester that given a graph with degree bound d, an expansion bound α, and a parameter ε > 0, accepts the graph with high probability if its expansion is more than α, and rejects it with high probability if it is ε-far from any graph (with degree bound 2d) with expansion Ω(α). The algorithm runs in ...
متن کاملQuantum Property Testing for Bounded-Degree Graphs
We study quantum algorithms for testing bipartiteness and expansion of bounded-degreegraphs. We give quantum algorithms that solve these problems in time Õ(N), beating theΩ(√N) classical lower bound. For testing expansion, we also prove an Ω̃(N) quantum querylower bound, thus ruling out the possibility of an exponential quantum speedup. Our quantumalgorithms follow fr...
متن کاملk-forested choosability of graphs with bounded maximum average degree
A proper vertex coloring of a simple graph is $k$-forested if the graph induced by the vertices of any two color classes is a forest with maximum degree less than $k$. A graph is $k$-forested $q$-choosable if for a given list of $q$ colors associated with each vertex $v$, there exists a $k$-forested coloring of $G$ such that each vertex receives a color from its own list. In this paper, we prov...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Random Structures & Algorithms
سال: 2010
ISSN: 1042-9832
DOI: 10.1002/rsa.20308